Analyzing and Representing Interpersonal Relations

ABSTRACT

A computer-implemented method for analyzing and representing interpersonal relations includes: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.

TECHNICAL FIELD

This document relates to analyzing and representing interpersonal relations.

BACKGROUND

Many computer systems store information that represents entities, both abstract and real ones. Some organizations operate an enterprise business system in a computer network to manage information about production, transactions, business partners and personnel, to name just a few examples. For example, the system can have stored therein database objects that correspond to and represent products, sales documents, customers or employees, as well as the relationships between any such entities. Database information is then updated with current information as needed.

However, the database of entities does not give an overview of any interpersonal relationships that may exist. Nor do such entities indicate the degree of separation between any two entities, for example whether they have relations to the same person. Moreover, some algorithms require as many queries as there are nodes in the graph of the relationships.

SUMMARY

In a first aspect, a computer-implemented method for analyzing and representing interpersonal relations includes: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.

In a second aspect, a computer program product is tangibly embodied in a computer-readable storage medium and includes instructions that when executed by a processor perform a method for analyzing and representing interpersonal relations. The method includes: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.

In a third aspect, a system includes: one or more processors; and a computer program product tangibly embodied in a computer-readable storage medium and comprising instructions that when executed by a processor perform a method for analyzing and representing interpersonal relations. The method includes: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.

Implementations can include any or all of the following features. The relational-database query includes: a first join of any relations that specify the person in at least one column; a second join of any persons who are specified in the relations of the first join; at least a first left join of relations that specify any of the persons of the second join; and at least a second left join of any persons who are specified in the relations of the first left join; wherein the relational-database query continues to perform left joins until the maximum number of steps is reached.

The relational-database query is executed on a relational database that includes a relations table, wherein for each relation the relations table includes a first column for a source of the relation and a second source for a target of the relation, and wherein the relational-database query selects the relation if the first column indicates the person and also if the second column indicates the person.

The user input identifies another person and seeks those of the interpersonal relations regarding the person that involve the identified other person.

The relational-database query is executed in an on-demand system to which a user uploads information about persons and connections, and after receiving the user input the on-demand system provides the representation of interpersonal relations to the user.

The user input specifies the maximum number of steps.

The method further includes generating a social graph as the representation of interpersonal relations.

Implementations can provide any or all of the following advantages. Organizational data can be analyzed, for example so as to calculate weights or prioritization. A single algorithm can be executed, for example to identify clusters that are then used in the analysis. One or more paths for a social network graph can be calculated. Iterations over relationships in a social network can be done faster or more efficiently. All available relationships at an arbitrary degree of separation from a person can be determined and presented.

The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features and advantages will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

FIG. 1 shows an example architecture for analyzing and representing interpersonal relations.

FIGS. 2A-B show an example of pseudocode for analyzing and representing interpersonal relations.

FIG. 3 shows an example algorithm for analyzing and representing interpersonal relations.

FIG. 4 shows another example algorithm for analyzing and representing interpersonal relations.

FIG. 5 is a block diagram of a computing system that can be used in connection with computer-implemented methods described in this document.

Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

This disclosure describes examples of analyzing and representing interpersonal relations. In some implementations, an algorithm for analyzing relations is implemented as a database query formulated in a basic query language for a relational database. With interpersonal relations it can almost always be assumed that the number of connections for any arbitrary node is limited, and that analyzing the database by executing a suitable query is therefore a manageable task. That is, even if an entity (e.g., an employee) has thousands of registered relations or more, a query engine can quickly go through the relations in the database and extend the search in one or more steps.

In some implementations, based on a specified starting entity (e.g., a specific employee) and the maximum numbers of separation steps that are of interest, the algorithm can find in the database and present all entities having relations to the starting entity of at most the maximum number of steps. As another example, based on two specified entities, the algorithm can find all relation paths that connect the two entities, optionally with at most the maximum number of steps.

FIG. 1 shows an example architecture 100 for analyzing and representing interpersonal relations. The architecture 100 includes at least one of each of: a database system 102, a server system 104 and a client system 106. One or more of the systems 102-106 can be distributed over more than one physical device. In some implementations, two or more of the systems 102-106 can be installed on the same device. The systems can communicate with each other and/or with other components (not shown) using any suitable connection, protocol or form of transmission. For example, the server system 104 and the client system 106 can be connected through one or more networks, such as the internet. The client system 106 can include a browser and/or at least one specially configured program capable of interfacing with the server system 104 and/or directly with the database system 102. In some implementations, other structures can be used, including those that do not involve a client-server architecture.

The database system 102 includes at least one relational database 108 and at least one query engine 110. For example, the database system 108 is considered part of a backend system. The query engine is configured to run queries on the database 108 using any suitable query language including, but not limited to, SQL. Such queries can be stored in the query engine ahead of time and executed upon command, or the query can be provided to the query engine in real time for execution, to name just two examples. Any suitable relational database can be used.

Here, the relational database 108 includes a number of tables. A relations table 112 is here shown to include at least four keys (id, source, target and type_id), for a relation ID, a source entity, a target entity and a type of relation, respectively. For example, an entry in the relation table can be represented as:

id source target type_id ABC123XYZ Person1 Person2 reportsTo

Namely, the above entry specifies that the relation called ABC123XYZ connects Person1 as reporting to Person2 in the organization that uses the database in this example. The terms Person1 and Person2 can be identifiers or names for respective employees, to name just two examples. Other relations can be used instead of, or in addition to, the one above. The relations table 112 will include one entry for each defined relation. In some implementations, one or more other columns can be included in the relations table. For example, the validity period for the relationship can be specified using one or more dates or times.

The relational database 108 includes an entities table 114 that has at least two keys (id and display_name) for an entity ID and the display name of that entity, respectively. For example, an entry in the relation table can be represented as:

id display_name Person2 Alexey Soshin

Namely, the above entry specifies that the entity called Person2 should be displayed as “Alexey Soshin”. In some implementations, the entities table 114 includes more columns to specify more information regarding each entity, for example the person's profile and/or a photograph of the person.

The server system 104 provides one or more services and makes them accessible to users. In some implementations, applications are implemented as programs executed in the server system. For example, one or more enterprise resource planning (ERP) programs can be operated to manage some aspect(s) of an organization's activities.

The client system 106 is used by one or more individual users to access the server system 104 and/or the database system 102. The user can retrieve information from the system(s), store new information therein, and/or manipulate existing information, to name just a few examples. In some implementations, the client system 106 is implemented using one or more personal computers, handheld computers, smartphones or any other suitable type of device. A user generates an input using the client system 106, which input requests a representation of interpersonal relations regarding a person to be shown, and this input is ultimately received in the database system 102. The input can identify the starting entity and can specify the maximum number of steps, for example.

The client system 106 can present results of relations analyses in one or more ways using a graphical user interface (GUI) 116. That is, the database system 102 can provide the representation of interpersonal relations first to the server system 104, which in turn can generate a corresponding transmission to the client system. In some implementations, the client system 106 uses a default GUI of one or more applications executed in the server system 104. For example, a default GUI provided for some enterprise applications from SAP AG can be used. In some implementations, a designated GUI is written to interface with the database system 102 and particularly to initiate a database query that executes an algorithm for analyzing interpersonal relations. Such designated GUI can receive information from the database system 102 in any suitable format. For example, information can be provided using XML code and/or according to JavaScript Object Notation (known as JSON).

In some implementations, the GUI 116 presents results in tabular form. A table 118A can then be displayed that shows names or other identifiers of persons that have been found in the analysis.

For example, assume that a user is interested in persons that are indirectly connected to “Alexey Soshin” through a “reportsTo” relation. Particularly, the user is only interested in those separated from Alexey Soshin by exactly two steps, and not, say, those that are separated by three or more steps and therefore potentially less acquainted with Alexey Soshin. Limiting the inquiry to a maximum number of separation steps can also avoid too many results. After the database query is performed on the relational database 102, the table 118A can include information as shown in the following partial excerpt:

Step display_name display_name display_name . . . 8 Alexey Soshin Ohad Yassin Eli Frumerman 9 Alexey Soshin Ohad Yassin Idan Bidani 10  Alexey Soshin Ohad Yassin Inbal Sabag . . .

That is, the table 118A here shows the result as a list of steps, where each step represents a relationship between Alexey Soshin and another person. The first column of names here lists Alexey Soshin for every step, because this starting entity is common to the entire query. In some implementations, this information is not displayed, or is displayed in a different fashion than the other retrieved names.

The second column of names here lists the persons for whom a “reportsTo” relation was found that also specified Alexey Soshin. Particularly, if the query is broadly formulated this will include both those who report to Alexey Soshin, and the person(s) to whom Alexey Soshin reports. Otherwise, only one of these categories is included. Because the table above shows only an excerpt of the table 118A, the second column of names here shows the same name—“Ohad Yassin”—in each entry, but one or more other names can occur in the other entries.

The third column of names here lists the persons for whom a “reportsTo” relation was found that also specified the corresponding person in the second column. Similarly, this can broadly include both directions of reporting-to relations, or only one of them.

In some implementations, the GUI 116 presents one or more results in graphical form. For example, a social graph 118B and/or social graph 118C can be displayed. A social graph can show one or more nodes 120 corresponding to identified entities, and one or more edges 122 corresponding to identified relations. For example, one or more of the nodes 120 can present a picture or other illustration of the corresponding entity.

The social graph 118B shows part of a relationship analysis limited to two steps. That is, the leftmost node 120 can represent the starting entity (e.g., Alexey Soshin in the above example), the middle node(s) can represent the person(s) having a specified relation to the starting entity (e.g., a “reportsTo” relation), and the rightmost nodes can represent the identified relations of the person in the middle.

In an analogous way, the social graph 118C can represent some or all identified edges 122 that connect the nodes 120. In some implementations, each of the edges 122 in the social graph 118B represents a path from one entity to another. For example, the query is restricted so that only those of the edges 122 that involve at most two steps of separation are displayed.

The algorithm that is used in the database system 102 does not need any specific implementation. Rather, the algorithm is written in the basic database query language (e.g., SQL) of the relational database. This can provide important advantages. For example, if data is originally received in an Oracle database and some relations analysis is performed there, then the same algorithm can also or instead be used on a laptop computer having an SQL query program installed, and obtain the same result for the same data. That is, in this situation all the logic is processed by the database core, rather than, say, by specially coded logic in the server or elsewhere. For this reason, there is no need to implement the algorithm in a different language even though the analysis should be performed in a different context. Moreover, only a single query needs to be executed regardless of the number of nodes in the graph of relationships.

Relations analysis can be performed in an on-demand environment. In some implementations, the architecture 100 is used to provide on-demand services including, but not limited to, detection of social networks. For example, a user can employ the client system 106 to upload information about persons and connections between the persons. The database system 102 can then execute a relational-database query. The resulting representation of interpersonal relations can then be provided to the user, for example along the lines of the above examples.

Some or all of an algorithm can be performed using in-memory technology. For example, the relational database 108 already has stored the relations between entities and one or more intersections can be performed in the database. Thereby, only the result of joining the groups (in multiple iterations, sometimes) is delivered. Some implementations involve the In-Memory Computing Engine available from SAP AG, for example in an implementation that uses the High Performance Analytical Appliance, known as HANA, also from SAP AG.

FIGS. 2A-B show an example of pseudocode 200 for analyzing and representing interpersonal relations. At 202, the relations r0 of the starting object e0 are found. In this example, all directions of “reportsTo” relationships are included in the query. At 204, relations are left joined on the currently identified entities, whereas at 206 entities are left joined on the currently identified relations. That is, use of the pseudocode 202 requires the relational database to support the join operation.

At 208, all entities that the algorithm has already iterated over are excluded. For example, this can avoid problems when two entities have mutual relations to each other.

FIG. 3 shows an example algorithm 300 for analyzing and representing interpersonal relations. For example, the algorithm 300 corresponds to the situation when the pseudocode 200 (FIG. 2) has the parameter=2, meaning that two steps of separation between entities is sought. At 302, the starting entity's :reportsTo” relations are selected. At 304, the entities of the selected relations are selected. At 306, the relations of the selected entities are selected. At 308, the entities of the selected relations are selected. In this example, “Alexey Soshin” is the starting entity.

FIG. 4 shows another example algorithm 400 for analyzing and representing interpersonal relations. Some aspects of the algorithm 400 are analogous to those of the algorithm 300 (FIG. 3). However, at 402 the algorithm 400 specifies that “Meni Tito” must be the target entity for all identified relations. Accordingly, the algorithm 400 seeks to find paths between two specified entities, in this example the relations that have two steps of separation. Moreover, all types of relations are covered by this algorithm, not merely “reportsTo” relations. This is indicated at 404 and 406 by not specifiying any type_id for the query.

FIG. 5 is a schematic diagram of a generic computer system 500. The system 500 can be used for the operations described in association with any of the computer-implement methods described previously, according to one implementation. The system 500 includes a processor 510, a memory 520, a storage device 530, and an input/output device 540. Each of the components 510, 520, 530, and 540 are interconnected using a system bus 550. The processor 510 is capable of processing instructions for execution within the system 500. In one implementation, the processor 510 is a single-threaded processor. In another implementation, the processor 510 is a multi-threaded processor. The processor 510 is capable of processing instructions stored in the memory 520 or on the storage device 530 to display graphical information for a user interface on the input/output device 540.

The memory 520 stores information within the system 500. In some implementations, the memory 520 is a computer-readable medium. The memory 520 is a volatile memory unit in some implementations and is a non-volatile memory unit in other implementations.

The storage device 530 is capable of providing mass storage for the system 500. In one implementation, the storage device 530 is a computer-readable medium. In various different implementations, the storage device 530 may be a floppy disk device, a hard disk device, an optical disk device, or a tape device.

The input/output device 540 provides input/output operations for the system 500. In one implementation, the input/output device 540 includes a keyboard and/or pointing device. In another implementation, the input/output device 540 includes a display unit for displaying graphical user interfaces.

The features described can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The apparatus can be implemented in a computer program product tangibly embodied in an information carrier, e.g., in a machine-readable storage device, for execution by a programmable processor; and method steps can be performed by a programmable processor executing a program of instructions to perform functions of the described implementations by operating on input data and generating output. The described features can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. A computer program is a set of instructions that can be used, directly or indirectly, in a computer to perform a certain activity or bring about a certain result. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.

Suitable processors for the execution of a program of instructions include, by way of example, both general and special purpose microprocessors, and the sole processor or one of multiple processors of any kind of computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memories for storing instructions and data. Generally, a computer will also include, or be operatively coupled to communicate with, one or more mass storage devices for storing data files; such devices include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).

To provide for interaction with a user, the features can be implemented on a computer having a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor for displaying information to the user and a keyboard and a pointing device such as a mouse or a trackball by which the user can provide input to the computer.

The features can be implemented in a computer system that includes a back-end component, such as a data server, or that includes a middleware component, such as an application server or an Internet server, or that includes a front-end component, such as a client computer having a graphical user interface or an Internet browser, or any combination of them. The components of the system can be connected by any form or medium of digital data communication such as a communication network. Examples of communication networks include, e.g., a LAN, a WAN, and the computers and networks forming the Internet.

The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a network, such as the described one. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

A number of implementations have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of this disclosure. Accordingly, other implementations are within the scope of the following claims. 

What is claimed is:
 1. A computer-implemented method for analyzing and representing interpersonal relations, the method comprising: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.
 2. The computer-implemented method of claim 1, wherein the relational-database query comprises: a first join of any relations that specify the person in at least one column; a second join of any persons who are specified in the relations of the first join; at least a first left join of relations that specify any of the persons of the second join; and at least a second left join of any persons who are specified in the relations of the first left join; wherein the relational-database query continues to perform left joins until the maximum number of steps is reached.
 3. The computer-implemented method of claim 2, wherein the relational-database query is executed on a relational database that includes a relations table, wherein for each relation the relations table includes a first column for a source of the relation and a second source for a target of the relation, and wherein the relational-database query selects the relation if the first column indicates the person and also if the second column indicates the person.
 4. The computer-implemented method of claim 2, wherein the user input identifies another person and seeks those of the interpersonal relations regarding the person that involve the identified other person.
 5. The computer-implemented method of claim 1, wherein the relational-database query is executed in an on-demand system to which a user uploads information about persons and connections, and wherein after receiving the user input the on-demand system provides the representation of interpersonal relations to the user.
 6. The computer-implemented method of claim 1, wherein the user input specifies the maximum number of steps.
 7. The computer-implemented method of claim 1, further comprising generating a social graph as the representation of interpersonal relations.
 8. A computer program product tangibly embodied in a computer-readable storage medium and comprising instructions that when executed by a processor perform a method for analyzing and representing interpersonal relations, the method comprising: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.
 9. The computer program product of claim 8, wherein the relational-database query comprises: a first join of any relations that specify the person in at least one column; a second join of any persons who are specified in the relations of the first join; at least a first left join of relations that specify any of the persons of the second join; and at least a second left join of any persons who are specified in the relations of the first left join; wherein the relational-database query continues to perform left joins until the maximum number of steps is reached.
 10. The computer program product of claim 9, wherein the relational-database query is executed on a relational database that includes a relations table, wherein for each relation the relations table includes a first column for a source of the relation and a second source for a target of the relation, and wherein the relational-database query selects the relation if the first column indicates the person and also if the second column indicates the person.
 11. The computer program product of claim 9, wherein the user input identifies another person and seeks those of the interpersonal relations regarding the person that involve the identified other person.
 12. The computer program product of claim 8, wherein the relational-database query is executed in an on-demand system to which a user uploads information about persons and connections, and wherein after receiving the user input the on-demand system provides the representation of interpersonal relations to the user.
 13. The computer program product of claim 8, wherein the user input specifies the maximum number of steps.
 14. The computer program product of claim 8, wherein the method further comprises generating a social graph as the representation of interpersonal relations.
 15. A system comprising: one or more processors; and a computer program product tangibly embodied in a computer-readable storage medium and comprising instructions that when executed by a processor perform a method for analyzing and representing interpersonal relations, the method comprising: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.
 16. The system of claim 15, wherein the relational-database query comprises: a first join of any relations that specify the person in at least one column; a second join of any persons who are specified in the relations of the first join; at least a first left join of relations that specify any of the persons of the second join; and at least a second left join of any persons who are specified in the relations of the first left join; wherein the relational-database query continues to perform left joins until the maximum number of steps is reached.
 17. The system of claim 16, wherein the relational-database query is executed on a relational database that includes a relations table, wherein for each relation the relations table includes a first column for a source of the relation and a second source for a target of the relation, and wherein the relational-database query selects the relation if the first column indicates the person and also if the second column indicates the person.
 18. The system of claim 16, wherein the user input identifies another person and seeks those of the interpersonal relations regarding the person that involve the identified other person.
 19. The system of claim 15, wherein the relational-database query is executed in an on-demand system to which a user uploads information about persons and connections, and wherein after receiving the user input the on-demand system provides the representation of interpersonal relations to the user.
 20. The system of claim 15, wherein the method further comprises generating a social graph as the representation of interpersonal relations. 